Two-level adaptation for Adaptive Multipreconditioned FETI

نویسندگان

چکیده

This article introduces two strategies to reduce the memory cost of Adaptive Multipreconditioned FETI method (AMPFETI) while preserving its capability solve ill conditioned systems efficiently. Their common principle is gather search directions into aggregates which are frequently adapted in order achieve best compromise between decrease solver error and computational resources employed. The methods assessed on weak scalability studies highly heterogeneous problems up 10,368 cores half a billion unknowns, ill-conditioned industrial applications, related numerical homogenization solid propellant simulation multiperforated aircraft combustion chamber.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Adaptive MultiPreconditioned Conjugate Gradient Algorithm

This article introduces and analyzes a new adaptive algorithm for solving symmetric positive definite linear systems in cases where several preconditioners are available or the usual preconditioner is a sum of contributions. A new theoretical result allows to select, at each iteration, whether a classical preconditioned CG iteration is sufficient (i.e., the error decreases by a factor of at lea...

متن کامل

Multipreconditioned Gmres for Shifted Systems

An implementation of GMRES with multiple preconditioners (MPGMRES) is proposed for solving shifted linear systems with shift-and-invert preconditioners. With this type of preconditioner, the Krylov subspace can be built without requiring the matrix-vector product with the shifted matrix. Furthermore, the multipreconditioned search space is shown to grow only linearly with the number of precondi...

متن کامل

Solving generalized eigenvalue problems on the interfaces to build a robust two level FETI method

FETI is a very popular method which has proved to be extremely efficient on many large scale industrial problems. One drawback is that it performs best when the decomposition of the global problem is closely related to the parameters in equations. This is somewhat confirmed by the fact that the theoretical analysis goes through only if some assumptions on the coefficients are satisfied. We prop...

متن کامل

A Multipreconditioned Conjugate Gradient Algorithm

We propose a generalization of the conjugate gradient method that uses multiple preconditioners, combining them automatically in an optimal way. The derivation is described in detail, and analytical observations are made. A short recurrence relation does not hold in general for this new method, but in at least one case such a relation is satisfied: for two symmetric positive definite preconditi...

متن کامل

Alternative Implementations of Two - Level Adaptive Branch

As the issue rate and depth of pipelining of high performance Superscalar processors increase, the importance of an excellent branch predictor becomes more vital to delivering the potential performance of a wide-issue, deep pipelined microarchitecture. We propose a new dynamic branch predictor (Two-Level Adaptive Branch Prediction) that achieves substantially higher accuracy than any other sche...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Engineering Software

سال: 2021

ISSN: ['1873-5339', '0965-9978']

DOI: https://doi.org/10.1016/j.advengsoft.2020.102952